Optimised ExpTime Tableaux for𝒮ℋℐ𝒩over Finite Residuated Lattices
نویسندگان
چکیده
منابع مشابه
Counting Finite Residuated Lattices
We study finite residuated lattices with up to 11 elements. We present an algorithm for generating all non-isomorphic finite residuated lattices with a given number of elements. Furthermore, we analyze selected properties of all the lattices generated by our algorithm and present summarizing statistics.
متن کاملExptime Tableaux for ALC
We propose a tableaux calculus requiring simple expo nential time for satis ability of an ALC concept C wrt a TBox T containing general axioms of the form C v D From correspondences with Propositional Dynamic Logic PDL it is known that this problem is in EX PTIME Pratt Vardi and Wolper How ever an algorithm directly derived from the methods used to prove such a result would always require expo ...
متن کاملTopological Residuated Lattices
In this paper, we study the separtion axioms $T_0,T_1,T_2$ and $T_{5/2}$ on topological and semitopological residuated lattices and we show that they are equivalent on topological residuated lattices. Then we prove that for every infinite cardinal number $alpha$, there exists at least one nontrivial Hausdorff topological residuated lattice of cardinality $alpha$. In the follows, we obtain some ...
متن کاملOptimised EXPTIME Tableaux for ALC Using Sound Global Caching, Propagation and Cutoffs
We show that global caching can be used with propagation of both satisfiability and unsatisfiability in a sound manner to give an EXPTIME algorithm for checking satisfiability w.r.t. a TBox in the basic description logic ALC. Our algorithm is based on a simple traditional tableau calculus which builds an and-or graph where no two nodes of the graph contain the same formula set. When a duplicate...
متن کاملDIRECTLY INDECOMPOSABLE RESIDUATED LATTICES
The aim of this paper is to extend results established by H. Onoand T. Kowalski regarding directly indecomposable commutative residuatedlattices to the non-commutative case. The main theorem states that a residuatedlattice A is directly indecomposable if and only if its Boolean center B(A)is {0, 1}. We also prove that any linearly ordered residuated lattice and anylocal residuated lattice are d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2014
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2014/702326